Solving an inverse heat conduction problem using genetic algorithm: Sequential and multi-core parallelization approach

In this paper a numerical approach combining the least squares method and the genetic algorithm (sequential and multi-core parallelization approach) is proposed for the determination of temperature in an inverse heat conduction problem (IHCP). Some numerical experiments confirm the utility of this algorithm as the results are in good agreement with the exact data. Results show that an excellent estimation can be obtained by implementation sequential genetic algorithm within a CPU with clock speed 2.7 GHz, and parallel genetic algorithm within a 16-core CPU with clock speed 2.7 GHz for each core.     

基于多处理器的视频跟踪系统研究

传统视频跟踪系统的目标检测环节常采用手动指定或使用单处理器运算来确定跟踪目标,这种方法耗费人力且检测速度慢。针对此问题提出了一种改进的图像分割方法,该方法采用多处理器系统构架,并行处理分割区域,增加了检测目标的速度,并且在后续目标跟踪环节中,各处理器根据任务划分,协同处理跟踪任务。实验结果表明基于多处理器系统构架的视频跟踪系统能够实现快速自动检测与跟踪目标,系统加速比为2．066,处理器效率为51．65％。     

Equivalent programmable quantum processors

Programmable quantum circuits, or processors, have the advantage over single-purpose quantum circuits that they can be used to perform more than one function. The inputs of a quantum processor consist of two quantum states, the first, the data register, is a state on which an operation is to be performed, and the second, the program, determines the operation to be performed on the data. In this paper we study how to determine whether two different quantum processors perform the same set of operations on the data. We define an equivalence between quantum processors that is quite natural in a circuit model of quantum information processing. Two processors are equivalent if one can be converted into the other by inserting fixed unitary gates at the input and the output of the program register. We then use this definition to find a necessary condition for two processors to be equivalent. We also study the beam splitter as an example of a quantum processor and find that this example suggests that as well as there being an equivalence relation on processors, there may also be a partial ordering.     

On-line scheduling of multi-core processor tasks with virtualization

We consider an on-line list scheduling problem of multi-core processor tasks with virtualization to minimize makespan. The competitive ratio of an on-line algorithm is shown for every specific m, where m is the number of processors. Better on-line algorithms are presented for a small number of processors.     

Reliability of Digitized Quantum Annealing and the Decay of Entanglement

A banged‐digital‐analog simulation of a quantum annealing protocol is performed in a two‐qubit nuclear magnetic resonance (NMR) quantum computer. The experimental simulation employs up to 235 Trotter steps, with more than 2000 gates (pulses), and a protocol success above 80% is obtained. Given the exquisite control of the NMR quantum computer, the simulation is also performed with different noise levels. Thus, the reliability of the quantum annealing process is is analyzed, and it is related to the level of entanglement produced during the protocol. Although the presence of entanglement is not a sufficient signature for a better‐than‐classical simulation, the level of entanglement achieved relates to the fidelity of the protocol.     

多芯光纤及其在弯曲传感中的应用

采用纤芯间距为38.78 μm的国产多芯光纤设计了一种光纤弯曲传感器.该多芯光纤弯曲传感器由长度为1 m的七芯光纤与单模光纤拼接制成,多芯光纤弯曲时,相邻的纤芯发生模式耦合.在传感器一侧,将宽带光注入到位于多芯光纤中心的纤芯,用光谱分析仪测量带有曲率信息的频谱,获得弯曲传感器的透射谱波长偏移与弯曲曲率半径的关系,结果表明:多芯光纤弯曲半径越小,弯曲曲率越大,串扰越明显.     

具有优先约束的不完全恒速机排序问题

讨论了任务具有优先约束的可中断不完全恒速机排序问题,若处理机具有不同开始加工时间的可中断排序问题存在最优算法,则相应的不完全恒速机排序问题也有最优算法。     

A parameterized ordering for cache-, register- and pipeline-efficient Givens QR decomposition

A parameterized ordering of Givens rotations and guidelines for choosing parameter values is presented in the context of QR decomposition. Although a standard selection of parameter values retrieves an ordering that corresponds to a well-known algorithm, we show that non-standard values decrease the execution time. We implement the new ordering on an Intel Pentium Pro system, a single thin POWER2 processor of the IBM SP2, and a single R8000 processor of the SGI POWER Challenge XL. On each machine, we observe performance that is more than twice that of the original ordering. This revised version was published online in June 2006 with corrections to the Cover Date.     

Open shop scheduling with some additional constraints

An open shop scheduling problem is presented; preemptions during processing of a job on a processorp is allowed but the job cannot be sent on another processorq before it is finished onp. A graph-theoretical model is described and a characterization is given for problems where schedules with such restricted preemptions useT time units whereT is the maximum of the processing times of the jobs and of the working times of the processors. The general case is shown to be NP-complete. We also consider the case where some constraints of simultaneity are present. Complexity of the problem is discussed and a solvable case is described.     

Approximation algorithms for scheduling on multi-core processor with shared speedup resources

We consider a joint resource partition and scheduling problem. We are given $m$ identical cores and discrete resources of total size $k$. We need to partition the resources among these cores. A set of jobs must be processed non-preemptively on these cores after the resource partition. The processing time of a job on a core depends on the size of resources allocated to that corresponding core. The resource allocation scheme is static, i.e., we cannot change the amount of resources that was allocated to a core during the whole scheduling. Hassidim et al. (2013) investigated this problem with a general processing time function, i.e., the processing time of a job is an arbitrary function of the level of resources allocated to that core. They provided an algorithm with approximation ratio of 36. In this paper, we improve the approximation ratio to 8 by presenting a new resource partition scheme. Next, we consider a special model where the core’s speed is proportional to its allocated resource, then we present two algorithms with improved approximation ratios.